基于营区精、气、神文化表达的自然仿生设计

精、气、神文化是营区规划设计的核心.自然仿生设计为营区精、气、神文化的表达提供了独特而有效的方式.通过对营区精、气、神文化的解读,发掘出自然仿生的3个层面,即“形”之仿生,“意”之仿生和“结构”之仿生.在营区规划设计中,当自然仿生的这3个层面得到有效表达,实现有机统一,营区就会产生独特的文化气质与魅力,从而体现其精、气、神特色,展现部队的“军营魂”.     

雷达虚拟维修训练中交互系统的通用性

基于USB接口技术对"通用雷达装备虚拟维修训练系统(URVMTS)"的人机交互系统进行研究,通过合理的软、硬件设计实现了系统的通用性。不同的实装操作部件经过适当的信号调理均可以通过该系统方便地实现与雷达虚拟样机之间的交互。着重介绍了交互系统的通用性设计与实现方法,包括系统的通用性设计方案,USB硬件电路的通用性设计及相应的软件开发。     

串联电路的谐振及其实验方法的研究

本文主要介绍电路中的串联谐振的利弊、串联谐振曲线的测试以及串联谐振曲线与品质因数的关系、品质因数与选择性及灵敏性的关系并研究实验测试电路和方法。     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

基于最小均方插值的码元同步算法研究

从软—硬件协同设计的角度出发 ,提出了软件无线电系统中码元同步的一种实现方案。该方案以信号插值为理论基础 ,用软件实现整个码元同步过程。其特点是以估计性能更佳的最小均方滤波器替代传统的多项式插值滤波器 ,并利用软件实现时可以进行大批量数据缓存的优势 ,提出能量检测算法 ,以克服半码元周期传输延迟时出现的高误码率问题     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

军标图形运动航迹平滑处理方法研究

在计算机运动仿真中时常会遇到军标所代表目标转弯的情况。为了让军标在转弯处体现出转弯半径,并能够平滑逼真地显示,采用改进的坐标定位算法,利用实时经纬度坐标对军标的位置进行描述,并形象地在海图上显示;以Visual C++6.0为开发工具对目前常用的cximage类调用Rotate()成员函数旋转图像后,显示中心会出现偏差的问题进行了修正,保证了军标显示中心的正确位置,实现了军标沿直线、转弯圆弧运动。